Functional Unification Grammar Revisited
نویسندگان
چکیده
In this paper, we show that one benefit of FUG, the ability to state global conslralnts on choice separately from syntactic rules, is difficult in generation systems based on augmented context free grammars (e.g., Def'mite Clause Cn'anmm~). They require that such constraints be expressed locally as part of syntactic rules and therefore, duplicated in the grammar. Finally, we discuss a reimplementation of lUg that achieves the similar levels of efficiency as Rubinoff's adaptation of MUMBLE, a detcrministc language generator. 1 I n t r o d u c t i o n Inefficiency of functional unification grammar (FUG, [5]) has prompted some effort to show that the same benefits offered by FUG can be achieved in other formalisms more efficiently [3; 14; 15; 16]. In this paper, we show that one benefit of FUG, the ability to conciselyl state global constraints on choice in generation, is difficult in other formalhms in which we have written generation systems. In particular, we show that a global constraint can be stated separately from syntactic rules in FUG, while in generation systems based on augmented context free ~g~nunars (e.g., Definite Clause Cn'amma~ (DCG, [13])) such consWaints must be expressed locally as part of syntactic rules and the~=for¢, duplicated in the grammar. Finally, we discuss a reimplementation of lUG in TAILOR [11; 12] that achieves the si.m/l~r leveLs of efficiency as Rubinoff's adaptation [16] of MUMBLE [7], a deterministc language generator. 1.1 Sta tement o f Const ra in ts Language generation can be viewed primarily as a problem of choice, requiring decisions about which syntactic structures best express intent. As a result, much research in language generanon has focused on identi~ing conswaints on choice, and it is important to be able to represent these constraints clearly and efficiently. In this paper, we compare the representation of constraints in FUG with their repn:sentation in a DCG generation system [3]. We are interested in representing functional constraints on syntactic sWacture where syntax does not fully restrict expression; that is, conswaints other than those coming from syntax. We look at the representation of two specific constraints on syntactic choice: focus of attention on the choice of sentence voice and focus of attention on the choice of simple versus complex sentences. We claim that, in a lUG, these constraints can be stated separately from rules dictating syntactic structure, thus leading to simplicity of the granunar since the constraints only need to be stated once. This is possible in FUG because of unification and the ability to build constituent structure in the grammar. In contrast, in a DCG, constraints must be stated as part of the individual grammar rules, resulting in duplication of a constraint for each syntactic rule to which it applies. 1.2 Passive/Active Cons t ra in t Focus of attention can determine whether the passive or active voice should be used in a sentence [8]. The constraint dictates that focused information should appear as surface subject in the sentence. In FUG, this can be represented by one pattern indicating that focus should occur f'u'st in the sentence as shown in Figu~ 1. This panern would occur in the sentence category of the grammar, since focus is a sentence constituent. This constraint is represented as part of an alternative so that other syntactic constraints can override it (e.g., if the goal were in focus but the verb could not be pmsivized, ~ constraint would not apply and an active sentence would be generated). The structure of active or passive would be indicated in the verb group as shown in Figure 2.1 The correct choice of active or passive is made through unification of the patterns: active voice is selected if the focus is on the protagonist (focus unifies with pro:) and passive if focus is on the goal or beneficiary Orocus unifies with goal or beheld. This representation has two desirable properties: the constraint can be stated simply and the construction of the resulting choice b expr=ssed separately from the constraint. ( a l t ( ( p a t t e r n ( f o c u s . . . ) ) ) ) Figure 1: Constraint on Passive/Active in FUG In the DCG, the unification of argument variables means a single rule can state that focus should occur first in the sentence. However, the rules specifying construction of the passive and active verb phrases must now depend on which role (protagonist, goal, or beneficiary) is in focus. This requires three separate rules, one of which will be chosen depending on which of the three other case roles is the same as the value for focus. The DCG v..presentation thus mixes information from the conswaint, focus of attention, with the passive/active construction, duplicating it over three tThis figure shows only the m'dm, of comtitmmu foe active and passive voice m~l does no¢ include odwr details of the co~au'ucdon.
منابع مشابه
A Prolog implementation of the Functional Unification Grammar Formalism
This paper compares the use of Lisp and Prolog for the implementation of a functional grammar unification system. To achieve this comparison, we have taken as a starting point Michael Elhadad’s FUF system, which is written in Lisp and produced a much smaller and more efficient Prolog version (PFUF) retaining many of FUF’s essential features. Our approach is based on a precompilation scheme that...
متن کاملD-PATR: A Development Environment for Unification-Based Grammars
I)-PATR is a development environment for unification-based grammars on Xerox l i00 series work stations. It is based on the PATR formalism developed at SRI International. This formalism is suitable for encoding a wide variety of grammars. At one end of this range are simple phrase-structure grammars with no feature augmentations. The PATR formalism can also be used to encode grammars that are b...
متن کاملUnification and Grammatical Theory
This paper informally presents a new view of grammar that has emerged from a number of distinct but related lines of investigation in theoretical and computational linguistics. Under this view, many current linguistic theories-including Lexical-Functional Grammar (LFG), Generalized Phraae Structure Grammar (GPSG), Head-Driven Phrase Structure Grammar (HPSG), and categorial grammar (CG)-fall wit...
متن کاملTreebank-Based Multilingual Unification-Grammar Development
Broad-coverage, deep unification grammar development is time-consuming and costly. This problem can be exacerbated in multilingual grammar development scenarios. Recently (Cahill et al., 2002) presented a treebank-based methodology to semi-automatically create broadcoverage, deep, unification grammar resources for English. In this paper we present a project which adapts this model to a multilin...
متن کاملA Logical Version of Functional Grammar
Kay's functional-unification grammar notation [5] is a way of expressing grammars which relies on very few primitive notions. The primary syntactic structure is the feature structure, which can be visualised as a directed graph with arcs labeled by at t r ibutes of a constituent, and the primary structure-building operation is unification. In this paper we propose a mathematical formulation of ...
متن کاملIntegrating a Unification-Based Semantics in a Large Scale Lexicalised Tree Adjoining Grammar for French
In contrast to LFG and HPSG, there is to date no large scale Tree Adjoining Grammar (TAG) equiped with a compositional semantics. In this paper, we report on the integration of a unification-based semantics into a Feature-Based Lexicalised TAG for French consisting of around 6 000 trees. We focus on verb semantics and show how factorisation can be used to support a compact and principled encodi...
متن کامل